A Sequent Calculus for Urn Logic
نویسنده
چکیده
Approximately speaking, an urn model for first-order logic is a model where the domain of quantification changes depending on the values of variables which have been bound by quantifiers previously. In this paper we introduce a modelchanging semantics for urn-models, and then give a sequent calculus for urn logic by introducing formulas which can be read as saying that “after the individuals a1, . . . , an have been drawn,A is the case”.
منابع مشابه
Focused Linear Logic and the λ-calculus
Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation...
متن کاملAxiomatizing Epistemic Logic of Friendship via Tree Sequent Calculus
This paper positively solves an open problem if it is possible to provide a Hilbert system to Epistemic Logic of Friendship (EFL) by Seligman, Girard and Liu. To find a Hilbert system, we first introduce a sound, complete and cut-free tree (or nested) sequent calculus for EFL, which is an integrated combination of Seligman’s sequent calculus for basic hybrid logic and a tree sequent calculus fo...
متن کاملA Sequent Calculus for Bilattice-Based Logic and Its Many-Sorted Representation
We introduce a sequent calculus for bilattice-based annotated logic (BAL). We show that this logic can be syntactically and semantically translated into a fragment MSL∗ of conventional many-sorted logic MSL. We show deductive equivalence of sequent calculus for BAL and sequent calculus for MSL∗.
متن کاملA Sequent Calculus for Dynamic Topological Logic
We introduce a sequent calculus for the temporal-over-topological fragment DTL ◦∗/2 0 of dynamic topological logic DTL, prove soundness semantically, and prove completeness syntactically using the axiomatization of DTL ◦∗/2 0 given in [3]. A cut-free sequent calculus for DTL ◦∗/2 0 is obtained as the union of the propositional fragment of Gentzen’s classical sequent calculus, two 2 structural r...
متن کاملProof Search and Countermodel Construction in Bi-intuitionistic Propositional Logic
Bi-intuitionistic propositional logic (also known as Heyting-Brouwer logic, subtractive logic) extends intuitionistic propositional logic with a connective that is dual to implication, called coimplication. It is the logic of bi-[Cartesian closed] categories and it also has a Kripke semantics. It first got the attention of C. Rauszer who studied it in a number of papers. Later, it has been inve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 24 شماره
صفحات -
تاریخ انتشار 2015